On Minimally (n, λ)-Connected Graphs
نویسندگان
چکیده
منابع مشابه
A note on minimally 3-connected graphs
If G is a minimally 3-connected graph and C is a double cover of the set of edges of G by irreducible walks, then |E (G)| ≥ 2 |C| − 2.
متن کاملNote on minimally k-connected graphs
A k-tree is either a complete graph on (k+1) vertices or given a k-tree G′ with n vertices, a k-tree G with (n+1) vertices can be constructed by introducing a new vertex v and picking a k-clique Q in G′ and then joining each vertex u in Q. A graph G is kedge-connected if the graph remains connected even after deleting fewer edges than k from the graph. A k-edge-connected graph G is said to be m...
متن کاملOn minimally rainbow k-connected graphs
An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. A graph G is called rainbow k-connected, if there is an edge-colouring of G with k colours such that G is rainbow-connected. In this talk we will study rainbow k-connected graphs with a minimum number of edges. For an integer n ≥ 3 and 1 ≤ k ≤ n − 1 let t(n, k) denote the...
متن کاملOn minimally 3-connected graphs on a surface
It is well-known that the maximal size of minimally 3-connected graphs of order 7 ≥ n is 9 3 − n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, and is embedded in a closed surface with Euler characteristic , χ then G contains at most } 2 , 2 min{ 2 χ − n edges. This bound is best possible for every closed surface.
متن کاملCharacterization of minimally (2, l)-connected graphs
For an integer l ≥ 2, the l-connectivity κl(G) of a graph G is defined to be the minimum number of vertices of G whose removal produces a disconnected graph with at least l components or a graph with fewer than l vertices. Let k ≥ 1, a graph G is called (k, l)-connected if κl(G) ≥ k. A graph G is called minimally (k, l)-connected if κl(G) ≥ k but ∀e ∈ E(G), κl(G − e) ≤ k − 1. We present a struc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2000
ISSN: 0095-8956
DOI: 10.1006/jctb.2000.1979